State maps of general behaviors, their lattice structure and bisimulations
نویسندگان
چکیده
In this paper we study the so called state maps in the behavioral approach to systems theory. The discussion in this paper continues some preliminary development presented in [5] and it also can be thought of as a generalization of the work in [10]. The concept of states or state variables is present in almost all branches of dynamical systems theory. In areas as remotely connected as discrete event systems and linear time invariant systems we can observe that the notion of states is present. One may think that this is a mere coincidence, but this is not true. The different notions of states have something in common. They are all connected by the so called state property or the axiom of state. In short (and perhaps rather inaccurately), one can say that a quantity or variable possesses the state property (or satisfies the axiom of state) if it captures the necessary information about the evolution of the dynamical system. There is of course a more mathematically formal and rigor formulation of this property, for example in [9]. In this paper, we will make use of this concept intensively, as will be revealed in the following sections. It is quite a common view in the field of dynamical systems that states are understood to be internal. When the system is interconnected with other systems, states usually do not appear explicitly in the description of the interconnection. Nevertheless, they play an arguably central role in characterizing the compatibility of the interconnection. We shall not discuss this issue further, and the interested reader is referred to [13] and [5]. Following the earlier development in [5, 10], our point of view, which is based on the behavioral approach, is that states are constructed out of the system trajectories (the behavior). In the behavioral point of view, the behavior (i.e. the collection of all possible
منابع مشابه
The categories of lattice-valued maps, equalities, free objects, and $mathcal C$-reticulation
In this paper, we study the concept of $mathcal C$-reticulation for the category $mathcal C$ whose objects are lattice-valued maps. The relation between the free objects in $mathcal C$ and the $mathcal C$-reticulation of rings and modules is discussed. Also, a method to construct $mathcal C$-reticulation is presented, in the case where $mathcal C$ is equational. Some relations between the conce...
متن کاملCrystal Structure and Lattice Parameter Investigation of La3+ Substituted CeO2 in LaxCe1-xO2-X/2 Synthesized by Solid-State Method
Lanthanum (La) doped Ceria (CeO2) has attracted considerable interest as a candidate material for thermal barrier coating (TBC) because of its low thermal conductivity and potential capability to be operated above 1250°C. In this study, La2Ce2O7 powder was synthesized through the ball mill method. The crystal structure of La3+ su...
متن کاملOpen Maps Bisimulations for Higher Dimensional Automata Models
The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of two models – higher dimensional automata (HDA) and timed higher dimensional automata (THDA) – in order to transfer general concepts of equivalences to the models. First, we define categories of the models under consideration, whose morphisms are to be thought of as simulat...
متن کاملOn Analytical Study of Self-Affine Maps
Self-affine maps were successfully used for edge detection, image segmentation, and contour extraction. They belong to the general category of patch-based methods. Particularly, each self-affine map is defined by one pair of patches in the image domain. By minimizing the difference between these patches, the optimal translation vector of the self-affine map is obtained. Almost all image process...
متن کاملMatching Equivalences on Higher Dimensional Automata Models∗
The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of two models – higher dimensional automata (HDA) and timed higher dimensional automata (THDA) – in order to transfer general concepts of equivalences to the models. First, we define categories of the models under consideration, whose morphisms are to be thought of as simulat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004